Branch and cut - PDFSEARCH.IO - Document Search Engine

Branch and cut
Results: 57

#	Item
51	Noncommercial Software for Mixed-Integer Linear Programming J. T. Linderoth∗ T. K. Ralphs† December, 2004. Add to Reading List Source URL: www.lehigh.edu Language: English - Date: 2005-08-16 17:57:41 Combinatorial optimization Relaxation Linear programming Linear programming relaxation Inequality Branch and cut MINTO Algorithm Cutting-plane method Mathematical optimization Mathematics Operations research
52	Rapid Implementation of Branch-and-Cut with Heuristics using GAMS Herman Abeledo and Hua (Edward) Ni George Washington University Michael Bussieck and Alex Meeraus Add to Reading List Source URL: www.gams.com Language: English - Date: 2008-07-25 06:05:23 Numerical software Mathematics Computer algebra systems CPLEX Algorithm Heuristic Mathematical optimization Solver Callback Operations research Mathematical software Applied mathematics
53	AALL CASE STUDY: SNELLA AND AALL FIGHT TO SAVE CONNECTICUT COURTHOUSE LIBRARIES May 2010 The Challenge Last year, Connecticut Governor Jodi M. Rell cut $12.9 million to the budget for the Judicial Branch, putting the sta Add to Reading List Source URL: aallnet.org Language: English Law library United States House Committee on Appropriations Science Knowledge Library science Librarian Library
54	SYMPHONY[removed]User’s Manual ∗ SYMPHONY Developed By T.K. Ralphs† L. Lad´anyi‡ Interactive Graph Drawing Add to Reading List Source URL: www.coin-or.org Language: English - Date: 2011-09-11 15:50:29 Applied mathematics Combinatorial optimization Linear programming relaxation Divide and conquer algorithm Algorithm Branch and cut COIN-OR Linear programming Cutting-plane method Mathematical optimization Mathematics Operations research
55	SYMPHONY 2.8 User’s Manual ∗ SYMPHONY Developed By T.K. Ralphs† Add to Reading List Source URL: www.coin-or.org Language: English - Date: 2011-09-11 15:50:29 Applied mathematics Combinatorial optimization Linear programming relaxation COIN-OR Divide and conquer algorithm Algorithm Branch and cut Linear programming Cutting-plane method Mathematical optimization Operations research Mathematics
56	SYMPHONY 3.0 User’s Manual ∗ SYMPHONY Developed By T.K. Ralphs† Add to Reading List Source URL: www.coin-or.org Language: English - Date: 2011-09-11 15:50:29 Applied mathematics Combinatorial optimization Linear programming relaxation COIN-OR Divide and conquer algorithm Algorithm Branch and cut Linear programming Cutting-plane method Mathematical optimization Operations research Mathematics
57	Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu Add to Reading List Source URL: www2.informatik.uni-freiburg.de Language: English - Date: 2010-05-29 10:18:47 Combinatorial optimization Mathematics Applied mathematics Heuristic function Admissible heuristic Heuristic Branch and bound Linear programming relaxation Relaxation Mathematical optimization Heuristics Operations research